Multidimensional structured matrices and polynomial systems
نویسندگان
چکیده
منابع مشابه
Multidimensional structured matrices and polynomial systems
We apply and extend some well known and some recent techniques from algebraic residue theory in order to relate to each other two major subjects of algebraic and numerical computing that is computations with structured matrices and solving a system of polynomial equations In the rst part of our paper we extend the Toeplitz and Hankel structures of matrices and some of their known properties to ...
متن کاملLaurent Polynomial Inverse Matrices and Multidimensional Perfect Reconstruction Systems
We study the invertibility of M -variate polynomial (respectively : Laurent polynomial) matrices of size N by P . Such matrices represent multidimensional systems in various settings including filter banks, multipleinput multiple-output systems, and multirate systems. Given an N × P polynomial matrix H(z) of degree at most k, we want to find a P × N polynomial (resp. : Laurent polynomial) left ...
متن کاملStructured Noncommutative Multidimensional Linear Systems
We introduce a class of multidimensional linear systems with evolution along a free semigroup. The transfer function for such a system is a formal power series in noncommuting indeterminates. Standard system-theoretic properties (the operations of cascade/parallel connection and inversion, controllability, observability, Kalman decomposition, state-space similarity theorem, minimal state-space ...
متن کاملSolving special polynomial systems by using structured matrices and algebraic residues
We apply and extend some well known and some recent tech niques from algebraic residue theory in order to relate to each other two major subjects of algebraic and numerical computing that is computa tions with structured matrices and solving a system of polynomial equa tions In the rst part of our paper we extend the Toeplitz and Hankel structures of matrices and some of their known properties ...
متن کاملRational and Polynomial Matrices
where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calcolo
سال: 1996
ISSN: 0008-0624,1126-5434
DOI: 10.1007/bf02576011